Ask
Login
TAGGED IN

Theory Of Computation

Follow this tag to get notifications whenever a new post is added

ALL TAGS
11
votes
1
answer
78k
views
1
answer
Write short note on Universal Turing Machine.
theory of computation updated 3.4 years ago by teamques10 ★ 64k
4
votes
1
answer
77k
views
1
answer
Applications of Regular Expression.
theory of computation updated 3.4 years ago by teamques10 ★ 64k
3
votes
1
answer
56k
views
1
answer
Difference between PDA and NPDA.
theory of computation updated 7.8 years ago by teamques10 ★ 64k
2
votes
1
answer
40k
views
1
answer
Explain the Myhill-Nerode Theorem
theory of computation updated 3.4 years ago by teamques10 ★ 64k
1
vote
1
answer
37k
views
1
answer
Difference between PDA and NPDA
theory of computation updated 5.6 years ago by teamques10 ★ 64k
0
votes
1
answer
36k
views
1
answer
Design a mealy machine to determine the residue mod 3 of a binary number.
theory of computation updated 2.3 years ago by teamques10 ★ 64k
1
vote
1
answer
33k
views
1
answer
Differentiate between NFA and DFA.
theory of computation updated 2.2 years ago by pedsangini276 • 4.7k
2
votes
1
answer
30k
views
1
answer
Explain the closure properties of regular languages
theory of computation updated 3.4 years ago by teamques10 ★ 64k
2
votes
1
answer
27k
views
1
answer
State and explain the power and limitations of a Turing machine.
theory of computation updated 2.3 years ago by teamques10 ★ 64k
2
votes
1
answer
25k
views
1
answer
Design a PDA to check for well-formed parentheses
theory of computation updated 3.4 years ago by teamques10 ★ 64k
2
votes
1
answer
24k
views
1
answer
a. Convert the following CFG to GNF S->AA|a A->SS|b
theory of computation updated 2.3 years ago by teamques10 ★ 64k
2
votes
1
answer
22k
views
1
answer
Design mealy machine to find out 2s complement of a binary number
theory of computation updated 2.3 years ago by teamques10 ★ 64k
2
votes
1
answer
20k
views
1
answer
Construct TM to check well formed mess of parenthesis.
theory of computation updated 7.8 years ago by teamques10 ★ 64k
1
vote
1
answer
20k
views
1
answer
Construct Turing machine that accepts the string over E={0,1} and converts every occurrence of 111 to 101.
theory of computation updated 3.4 years ago by teamques10 ★ 64k
0
votes
1
answer
16k
views
1
answer
Write Short Notes on Kleene Closure
theory of computation updated 3.4 years ago by teamques10 ★ 64k
1
vote
1
answer
15k
views
1
answer
Explain with an example the Chomsky hierarchy.
theory of computation updated 3.4 years ago by teamques10 ★ 64k
0
votes
1
answer
15k
views
1
answer
Design Moore Machine for the input from (0+ 1 +2) * which print the residue modulo 5 of the input treated as ternary number.
theory of computation updated 3.4 years ago by teamques10 ★ 64k
1
vote
1
answer
14k
views
1
answer
Convert the following grammar to GNF
theory of computation updated 3.4 years ago by teamques10 ★ 64k
1
vote
1
answer
13k
views
1
answer
What are the steps to convert a Moore machine to a Mealy machine? Design a Moore machine to convert each occurrence of 100 to 101. Convert it into an equivalent Mealy machine using the above mentioned
theory of computation updated 3.4 years ago by teamques10 ★ 64k
1
vote
1
answer
13k
views
1
answer
State and explain decision properties of regular languages
theory of computation updated 2.3 years ago by teamques10 ★ 64k
1
vote
1
answer
12k
views
1
answer
Design a turing machine that computes a function f(m,n)=m+n i.e. addition of two integers
theory of computation updated 2.3 years ago by teamques10 ★ 64k
1
vote
1
answer
12k
views
1
answer
State and prove Rice's theorem.
theory of computation updated 3.4 years ago by teamques10 ★ 64k
0
votes
1
answer
12k
views
1
answer
Design Moore Machine to generate output A if string is ending with abb, B if string ending with aba and C otherwise over alphabet (a,b).And Convert it to Mealy machine.
theory of computation updated 3.4 years ago by teamques10 ★ 64k
1
vote
1
answer
10k
views
1
answer
Design a finite stat machine to determine whether tennary number divisible by 5
theory of computation updated 3.4 years ago by teamques10 ★ 64k
2
votes
1
answer
10k
views
1
answer
Compare recursive and recursively enumerable languages
theory of computation updated 3.4 years ago by teamques10 ★ 64k
<prev • 104 results • page 1 of 5 • next >